Verification in Staged Tile Self-Assembly

We prove the unique assembly and unique shape verification problems, benchmark measures of self-assembly model power, are $\mathrm{coNP}^{\mathrm{NP}}$-hard and contained in $\mathrm{PSPACE}$ (and in $\mathrm{\Pi}^\mathrm{P}_{2s}$ for staged systems with $s$ stages). En route, we prove that unique shape verification problem in the 2HAM is $\mathrm{coNP}^{\mathrm{NP}}$-complete.Comment: An abstract version will appear in the proceedings of UCNC 201

Paper Session II-B - Prospects for the NICMOS Cryocooler

The NICMOS Cooling System (NCS) is due to be installed in the Hubble Space Telescope during the Third Servicing Mission in late 1999. This mechanical cooling system will extend the operating lifetime of the Near-Infrared Camera and Multi-Object Spectrometer (NICMOS) instrument which was installed during the last servicing mission in February 1997. This will be the first space application for a high-capacity (10 W cooling), reverse Brayton cycle mechanical cryogenic cooler. Development is on track for a demonstration STS flight in late 1998

Laser-Based Nano Fabrication and Nano Lithography

The improvement of fabrication resolutions is an eternal challenge for miniaturizing and enhancing the integration degrees of devices. Laser processing is one of the most widely used techniques in manufacturing due to its high flexibility, high speed, and environmental friendliness. The fabrication resolution of laser processing is, however, limited by the diffraction limit. Recently, much effort has been made to overcome the diffraction limit in nano fabrication. Specifically, combinations of multiphoton absorption by ultrafast lasers and the threshold effect associated with a Gaussian beam profile provide fabrication resolutions far beyond the diffraction limit. The use of the optical near-field achieves nano ablation with feature sizes below 100 nm. Multiple pulse irradiation from the linearly polarized ultrafast laser produces periodic nanostructures with a spatial period much smaller than the wavelength. Unlimited diffraction resolutions can also be achieved with shaped laser beams. In the meanwhile, lasers are also widely used for the synthesis of nano materials including fullerenes and nano particles. In view of the rapid advancement of this field in recent years, this Special Issue aims to introduce the state-of-the-art in nano fabrication and nano lithography, based on laser technologies, by leading groups in the field

Matching of objects moving across disjoint cameras

Matching of single individuals as they move across disjoint camera views is a challenging task in video surveillance. In this paper, we present a novel algorithm capable of matching single individuals in such a scenario based on appearance features. In order to reduce the variable illumination effects in a typical disjoint camera environment, a cumulative color histogram transformation is first applied to the segmented moving object. Then, an incremental major color spectrum histogram representation (IMCSHR) is used to represent the appearance of a moving object and cope with small pose changes occurring along the track. An IMCHSR-based similarity measurement algorithm is also proposed to measure the similarity of any two segmented moving objects. A final step of post-matching integration along the object's track is eventually applied. Experimental results show that the proposed approach proved capable of providing correct matching in typical situations. ©2006 IEEE

Tracking people across disjoint camera views by an illumination-tolerant appearance representation

Tracking single individuals as they move across disjoint camera views is a challenging task since their appearance may vary significantly between views. Major changes in appearance are due to different and varying illumination conditions and the deformable geometry of people. These effects are hard to estimate and take into account in real-life applications. Thus, in this paper we propose an illumination-tolerant appearance representation, which is capable of coping with the typical illumination changes occurring in surveillance scenarios. The appearance representation is based on an online k-means colour clustering algorithm, a data-adaptive intensity transformation and the incremental use of frames. A similarity measurement is also introduced to compare the appearance representations of any two arbitrary individuals. Post-matching integration of the matching decision along the individuals' tracks is performed in order to improve reliability and robustness of matching. Once matching is provided for any two views of a single individual, its tracking across disjoint cameras derives straightforwardly. Experimental results presented in this paper from a real surveillance camera network show the effectiveness of the proposed method. © Springer-Verlag 2007

Suicide contagion: A systematic review of definitions and research utility

Objectives Despite the common use of contagion to analogize the spread of suicide, there is a lack of rigorous assessment of the underlying concept or theory supporting the use of this term. The present study aims to examine the varied definitions and potential utility of the term contagion in suicide-related research. Methods 100 initial records and 240 reference records in English were identified as relevant with our research objectives, through systematic literature screening. We then conducted narrative syntheses of various definitions and assessed their potential value for generating new research. Results 20.3% of the 340 records used contagion as equivalent to clustering (contagion-as-cluster); 68.5% used it to refer to various, often related mechanisms underlying the clustering phenomenon (contagion-as-mechanism); and 11.2% without clear definition. Under the category of contagion-as-mechanism, four mechanisms have been proposed to explain how suicide clusters occurred: transmission (contagion-as-transmission), imitation (contagion-as-imitation), contextual influence (contagion-as-context), and affiliation (contagion-as-affiliation). Contagion-as-cluster both confounds and constrains inquiry into suicide clustering by blending proposed mechanism with the phenomenon to be studied. Contagion-as-transmission is, in essence, a double or internally redundant metaphor. Contagion-as-affiliation and contagion-as-context involve mechanisms that are common mechanisms that often occur independently of apparent contagion, or may serve as a facilitating background. When used indiscriminately, these terms may create research blind spots. Contagion-as-imitation combines perspectives from psychology, sociology, and public health research and provides the greatest heuristic utility for examining whether and how suicide and suicidal behaviors may spread among persons at both individual and population levels. Conclusion Clarifying the concept of “suicide contagion” is an essential step for more thoroughly investigating its mechanisms. Developing a clearer understanding of the apparent spread of suicide-promoting influences can, in turn, offer insights necessary to build the scientific foundation for prevention and intervention strategies that can be applied at both individual and community levels.published_or_final_versio

Self-Assembly of 4-sided Fractals in the Two-handed Tile Assembly Model

We consider the self-assembly of fractals in one of the most well-studied models of tile based self-assembling systems known as the Two-handed Tile Assembly Model (2HAM). In particular, we focus our attention on a class of fractals called discrete self-similar fractals (a class of fractals that includes the discrete Sierpi\'nski carpet). We present a 2HAM system that finitely self-assembles the discrete Sierpi\'nski carpet with scale factor 1. Moreover, the 2HAM system that we give lends itself to being generalized and we describe how this system can be modified to obtain a 2HAM system that finitely self-assembles one of any fractal from an infinite set of fractals which we call 4-sided fractals. The 2HAM systems we give in this paper are the first examples of systems that finitely self-assemble discrete self-similar fractals at scale factor 1 in a purely growth model of self-assembly. Finally, we show that there exists a 3-sided fractal (which is not a tree fractal) that cannot be finitely self-assembled by any 2HAM system

An extension of SPARQL for expressing qualitative preferences

In this paper we present SPREFQL, an extension of the SPARQL language that allows appending a PREFER clause that expresses "soft" preferences over the query results obtained by the main body of the query. The extension does not add expressivity and any SPREFQL query can be transformed to an equivalent standard SPARQL query. However, clearly separating preferences from the "hard" patterns and filters in the WHERE clause gives queries where the intention of the client is more cleanly expressed, an advantage for both human readability and machine optimization. In the paper we formally define the syntax and the semantics of the extension and we also provide empirical evidence that optimizations specific to SPREFQL improve run-time efficiency by comparison to the usually applied optimizations on the equivalent standard SPARQL query.Comment: Accepted to the 2017 International Semantic Web Conference, Vienna, October 201

Optimal staged self-assembly of linear assemblies

We analyze the complexity of building linear assemblies, sets of linear assemblies, and O(1)-scale general shapes in the staged tile assembly model. For systems with at most b bins and t tile types, we prove that the minimum number of stages to uniquely assemble a 1 n line is (logt n + logb n t + 1). Generalizing to O(1) n lines, we prove the minimum number of stages is O( log n tb t log t b2 + log log b log t ) and ( log n tb t log t b2 ). Next, we consider assembling sets of lines and general shapes using t = O(1) tile types. We prove that the minimum number of stages needed to assemble a set of k lines of size at most O(1) n is O( k log n b2 + k p log n b + log log n) and ( k log n b2 ). In the case that b = O( p k), the minimum number of stages is (log n). The upper bound in this special case is then used to assemble \hefty shapes of at least logarithmic edge-length-to- edge-count ratio at O(1)-scale using O( p k) bins and optimal O(log n) stages

Understanding road congestion as an emergent property of traffic networks

ABSTRACT Despite a considerable amount of research into the modelling of traffic flow through road networks, a clear understanding of the conditions that cause and exacerbate urban road congestion remains elusive. This paper presents a novel approach to this problem, by identifying congestion as an unintentional emergent property of driver-to-driver interactions. It is described how human interaction is a constant and important intrinsic property of city driving, and how these interactions can lead to explicit phenomena. A framework is presented for the further analysis of congestion at three spatial levels, and the driver behaviours that may be of most significance at each described. Building on this model, the paper presents a case study carried out at the highly congested Blackwall Tunnel in London. In providing evidence for some of the concepts described in this paper, the case study demonstrates how human behaviour causes the emergence of road congestion. The concepts and framework presented in this paper represent a strong starting point for further understanding and eventual modelling of the occurrence and spread of road congestion